Trees with three leaves are (n+1)-unavoidable
نویسندگان
چکیده
منابع مشابه
Trees with three leaves are (n + l)-unavoidable
We prove that every tree of order n 5 with three leaves is (n + 1)-unavoidable. More precisely, we prove that every tree A with three leaves of order n is contained in every tournament T of order n + 1 except if (T ; A) is (R 5 ; S + 3) or its dual, where R 5 is the regular tournament on ve vertices and S + 3 is the outstar of degree three, that is, the tree consisting of a root dominating thre...
متن کاملUnavoidable trees and forests in graphs
Classic results from extremal graph theory state that if certain graphs are made large enough, unavoidable substructures appear. Here we will cover this type of problem for specific graphs when these substructures are certain trees or forests. After giving a summary on related results, the following two extremal main problems are presented: For a given family of same-order trees including the s...
متن کاملSpotting Trees with Few Leaves
We show two results related to the Hamiltonicity and k-Path algorithms in undirected graphs by Björklund [FOCS’10], and Björklund et al., [arXiv’10]. First, we demonstrate that the technique used can be generalized to finding some k-vertex tree with l leaves in an n-vertex undirected graph in O(1.6572) time. It can be applied as a subroutine to solve the k-Internal Spanning Tree (k-IST) problem...
متن کاملSpanning directed trees with many leaves
The Directed Maximum Leaf Out-Branching problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we obtain two combinatorial results on the number of leaves in out-branchings. We show that – every strongly connected n-vertex digraph D with minimum indegree at least 3 has an out-branching with at least (n/4) −...
متن کاملOn finding spanning trees with few leaves
The problem of finding a spanning tree with few leaves is motivated by the design of communication networks, where the cost of the devices depends on their routing functionality (ending, forwarding, or routing a connection). Besides this application, the problem has its own theoretical importance as a generalization of the Hamiltonian path problem. Lu and Ravi showed that there is no constant f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00366-4